On Zero Left Prime Factorizations for Matrices over Unique Factorization Domains

Lectures On Unique Factorization Domains

Unique Prime Cartesian Factorization of Graphs over Finite Fields

A fundamental result, due to Sabidussi and Vizing, states that every connected graph has a unique prime factorization relative to the Cartesian product; but disconnected graphs are not uniquely prime factorable. This paper describes a system of modular arithmetic on graphs under which both connected and disconnected graphs have unique prime Cartesian factorizations.

Unique Factorization Monoids and Domains

It is the purpose of this paper to construct unique factorization (uf) monoids and domains. The principal results are: (1) The free product of a well-ordered set of monoids is a uf-monoid iff every monoid in the set is a uf-monoid. (2) If M is an ordered monoid and F is a field, the ring ^[[iW"]] of all formal power series with well-ordered support is a uf-domain iff M is naturally ordered (i.e...

Unique Factorization in Integral Domains

Throughout R is an integral domain unless otherwise specified. Let A and B be sets. We use the notation A ⊆ B to indicate that A is a subset of B and we use the notation A ⊂ B to mean that A is a proper subset of B. The group of elements in R which have a multiplicative inverse (the group of units of R) is denoted R×. Since R has no zero divisors cancellation holds. If a, b, c ∈ R and a 6= 0 th...

On zero divisor graph of unique product monoid rings over Noetherian reversible ring

 Let $R$ be an associative ring with identity and $Z^*(R)$ be its set of non-zero zero divisors.  The zero-divisor graph of $R$, denoted by $Gamma(R)$, is the graph whose vertices are the non-zero  zero-divisors of  $R$, and two distinct vertices $r$ and $s$ are adjacent if and only if $rs=0$ or $sr=0$.  In this paper, we bring some results about undirected zero-divisor graph of a monoid ring o...